T = int(input())
for _ in range(T):
n = int(input())
a = list(map(int, input().split()))
marker = [-1] * 150001
ans = 150001
for i in range(n):
if marker[a[i]] == -1:
marker[a[i]] = i
else:
ans = min(ans, i - marker[a[i]])
marker[a[i]] = i
if ans == 150001:
print(-1)
else:
print(n - ans)#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll tt;
tt=1;
cin >> tt;
while (tt--)
{
ll n;
cin >> n;
vector<ll> v(n);
map<ll,ll> mp;
ll mn = INT_MAX;
for( ll i = 0; i < n; i++ ){
cin >> v[i];
if(mp.find(v[i])!=mp.end()){
mn = min(mn, (i-mp[v[i]]));
mp[v[i]]=i;
}
else{
mp[v[i]]=i;
}
}
if(mn==INT_MAX){
cout<<-1<<"\n";
}
else{
cout<<n-mn<<"\n";
}
}
return 0;
}74. Search a 2D Matrix | 71. Simplify Path |
62. Unique Paths | 50. Pow(x, n) |
43. Multiply Strings | 34. Find First and Last Position of Element in Sorted Array |
33. Search in Rotated Sorted Array | 17. Letter Combinations of a Phone Number |
5. Longest Palindromic Substring | 3. Longest Substring Without Repeating Characters |
1312. Minimum Insertion Steps to Make a String Palindrome | 1092. Shortest Common Supersequence |
1044. Longest Duplicate Substring | 1032. Stream of Characters |
987. Vertical Order Traversal of a Binary Tree | 952. Largest Component Size by Common Factor |
212. Word Search II | 174. Dungeon Game |
127. Word Ladder | 123. Best Time to Buy and Sell Stock III |
85. Maximal Rectangle | 84. Largest Rectangle in Histogram |
60. Permutation Sequence | 42. Trapping Rain Water |
32. Longest Valid Parentheses | Cutting a material |
Bubble Sort | Number of triangles |
AND path in a binary tree | Factorial equations |